منابع مشابه
New Bounds on the Size of Optimal Meshes
The theory of optimal size meshes gives a method for analyzing the output size (number of simplices) of a Delaunay refinement mesh in terms of the integral of a sizing function over the input domain. The input points define a maximal such sizing function called the feature size. This paper presents a way to bound the feature size integral in terms of an easy to compute property of a suitable or...
متن کاملon the comparison of keyword and semantic-context methods of learning new vocabulary meaning
the rationale behind the present study is that particular learning strategies produce more effective results when applied together. the present study tried to investigate the efficiency of the semantic-context strategy alone with a technique called, keyword method. to clarify the point, the current study seeked to find answer to the following question: are the keyword and semantic-context metho...
15 صفحه اولNew Bounds on the Size of the Minimum Feedback Vertex Set in Meshes and Butterflies
Given a graph G = (V;E), the minimum feedback vertex set S is a subset of vertices of minimum size, whose removal induces an acyclic subgraph G0 = (VnS;E 0). The problem of finding S is NP–complete in general graphs, although polynomial time solutions exist for particular classes of graphs. this paper we present upper and lower bounds on the size of the minimum feedback vertex set in meshes and...
متن کاملOptimal Angle Bounds for Quadrilateral Meshes
We show that any simple planar n-gon can be meshed in linear time by O(n) quadrilaterals with all new angles bounded between 60 and 120 degrees. 1991 Mathematics Subject Classification. Primary: 30C62 Secondary:
متن کاملNew Bounds on Optimal Sorting Networks
We present new parallel sorting networks for 17 to 20 inputs. For 17, 19, and 20 inputs these new networks are faster (i.e., they require less computation steps) than the previously known best networks. Therefore, we improve upon the known upper bounds for minimal depth sorting networks on 17, 19, and 20 channels. Furthermore, we show that our sorting network for 17 inputs is optimal in the sen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Graphics Forum
سال: 2012
ISSN: 0167-7055
DOI: 10.1111/j.1467-8659.2012.03168.x